Minimal Length Paths-A Geometric Approach
نویسندگان
چکیده
This work presents the minimal length paths, for a robot that maintains risibility of a landmark. The robot is a differential drive system and has limited sensing capabilities (range and angle of view). The optimal paths are eomposed of straight liner and curves that saturate L e Camera pan angle.
منابع مشابه
Minimal and maximal plateau lengths in Motzkin paths
The minimal length of a plateau (a sequence of horizontal steps, preceded by an upand followed by a down-step) in a Motzkin path is known to be of interest in the study of secondary structures which in turn appear in mathematical biology. We will treat this and the related parameters maximal plateau length, minimal horizontal segment and maximal horizontal segment as well as some similar parame...
متن کاملPosynomial geometric programming problem subject to max–product fuzzy relation equations
In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some pr...
متن کاملDifferential Geometric Path Planning of Multiple UAVs
Safe and simultaneous arrival of constant speed, constant altitude unmanned air vehicles (UAVs) on target is solved by design of paths of equal lengths. The starting point for our solution is the well-known Dubins path, which is composed of circular arc and line segments, thus requiring only one simple maneuver—constant rate turn. An explicit bound can be imposed on the rate during the design a...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملInapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
We study the complexity of two Inverse Shortest Paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph, the task is to find positive integer arc lengths such that the given paths are uniquely determined shortest paths between their respective terminals. The first problem seeks for arc lengths that...
متن کامل